Periodic Fourier representation of Boolean functions
نویسندگان
چکیده
منابع مشابه
Periodic Fourier representation of boolean functions
In this work, we consider a new type of Fourier-like representation of boolean function f : {+1,−1}n → {+1,−1} f(x) = cos π ∑ S⊆[n] φS ∏
متن کاملPolynomial representation, Fourier transform and complexity of Boolean functions
We study the Log-rank Conjecture for XOR functions and the Sensitivity Conjecture by exploiting structure of the Fourier transform and polynomial representations of Boolean functions. For the Log-rank Conjecture for XOR functions, we show that the it is true for functions with small spectral norm or low F2-degree. More precisely, we prove the following two bounds. 1. CC(f(x⊕ y)) = O(‖f̂‖1 · log ...
متن کاملFourier Analysis of Boolean Functions
This paper introduces the technique of Fourier analysis applied to Boolean functions. We use this technique to illustrate proofs of both Arrow’s Impossibility Theorem and H̊astad’s 3-bit Theorem.
متن کاملLearning Boolean Functions via the Fourier Transform
We survey learning algorithms that are based on the Fourier Transform representa tion In many cases we simplify the original proofs and integrate the proofs of related results We hope that this would give the reader a complete and comprehensive un derstanding of both the results and the techniques Introduction The importance of using the right representation of a function in order to approximat...
متن کاملSome results of 2-periodic functions by Fourier sums in the space Lp(2)
In this paper, using the Steklov function, we introduce the generalized continuity modulus and denethe class of functions Wr;kp;' in the space Lp. For this class, we prove an analog of the estimates in [1]in the space Lp.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2019
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic19.5-6-2